MOST SIMPLE EXTENSIONS OF FLe ARE UNDECIDABLE
نویسندگان
چکیده
منابع مشابه
Why Most Bright Stars are Binary But Most Dim Stars Are Single: A Simple Qualitative Explanation
It is known that most visible stars are binary: they have a nearby companion star, and these two stars orbit around each other. Based on this fact, until recently, astronomers believed that, in general, most stars are binary. A few years ago, a surprising paper showed that while most bright stars are indeed binary, most dim stars are single. In this paper, we provide a simple qualitative explan...
متن کاملThree-Processor Tasks Are Undecidable
We show that no algorithm exists for deciding whether a nite task for three or more processors is wait-free solvable in the asyn-chronous read-write shared-memory model. This impossibility result implies that there is no constructive (recursive) characterization of wait-free solvable tasks. It also applies to other shared-memory models of distributed computing, such as the comparison-based model.
متن کاملPropositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensions
In this paper, we investigate the expressiveness of the variety of propositional interval neighborhood logics (PNL), we establish their decidability on linearly ordered domains and some important sub-classes, and we prove undecidability of a number of extensions of PNL with additional modalities over interval relations. All together, we show that PNL form a quite expressive and nearly maximal d...
متن کاملSimple Extensions of Polytopes
We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P . We devise a combinatorial method to establish lower bounds on the simple extension complexity and show for several polytopes that they have large simple extension complexities. These example...
متن کاملDynamical systems with double recursion are undecidable
A primitive type of dynamical system is introduced. It is shown that there is no decision procedure able to answer if any such dynamical system is ultimately zero. A.M.S.-Classification: 12L05.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 2021
ISSN: 0022-4812,1943-5886
DOI: 10.1017/jsl.2021.46